Proof Complexity of Modal Resolution.
Sigley S, Beyersdorff O.
Sigley S, et al.
J Autom Reason. 2022;66(1):1-41. doi: 10.1007/s10817-021-09609-9. Epub 2021 Oct 13.
J Autom Reason. 2022.
PMID: 35068630
Free PMC article.
We investigate the proof complexity of modal resolution systems developed by Nalon and Dixon (J Algorithms 62(3-4):117-134, 2007) and Nalon et al. (in: Automated reasoning with analytic Tableaux and related methods-24th international conference, (TABLEAUX'15), pp 185-200, …
We investigate the proof complexity of modal resolution systems developed by Nalon and Dixon (J Algorithms 62(3-4):117-134, 2007) and …